package com.iris.dataStructures;

public class Queue<T> {
	private T[] tArray ;
	private int curPoint=-1;
	private int maxPoint=-1;
	private int startPoint=-1;
	private int size=0;
	public Queue(int size){
		tArray = (T[]) new Object[size];
		maxPoint=size;
	}
	public void push(T t) throws Exception{
		if(size>=maxPoint){
			throw new Exception("已满");
		}
		curPoint++;
		tArray[curPoint]=t;
		startPoint++;
//		LinkedList<E>
	}
}
